منابع مشابه
Regular symmetric groups of boolean functions
is called a Boolean function. By Aut(f) we denote the set of all symmetries of f , i.e., these permutation σ ∈ Sn for which f(xσ(1), . . . , xσ(n)) = f(x1, . . . , xn). We show the solution of a problem posed by A. Kisielewicz ([1]). We show that, with the exception of four known groups of small order, every regular permutation group is isomorphic with Aut(f) for some Boolean function f . We pr...
متن کاملBerge Multiplication for Monotone Boolean Dualization
Given the prime CNF representation φ of a monotone Boolean function f : {0, 1} 7→ {0, 1}, the dualization problem calls for finding the corresponding prime DNF representation ψ of f . A very simple method (called Berge multiplication [3, Page 52–53]) works by multiplying out the clauses of φ from left to right in some order, simplifying whenever possible using the absorption law. We show that f...
متن کاملOn Berge Multiplication for Monotone Boolean Dualization
Given the prime CNF representation φ of a monotone Boolean function f : {0, 1} 7→ {0, 1}, the dualization problem calls for finding the corresponding prime DNF representation ψ of f . A very simple method (called Berge multiplication [3, Page 52–53]) works by multiplying out the clauses of φ from left to right in some order, simplifying whenever possible using the absorption law. We show that f...
متن کاملMonotone Boolean dualization is in co-NP[log2n]
In 1996, Fredman and Khachiyan [J. Algorithms 21 (1996) 618–628] presented a remarkable algorithm for the problem of checking the duality of a pair of monotone Boolean expressions in disjunctive normal form. Their algorithm runs in no(logn) time, thus giving evidence that the problem lies in an intermediate class between P and co-NP. In this paper we show that a modified version of their algori...
متن کاملCreation of Overlay Tilings through Dualization of Regular Networks
Tilings of the plane have long been appreciated as an art form, and have been used in a wide variety of decorative applications, from fabrics to architecture. In this paper, we develop a method of creating tilings based on an underlying network (a mathematical structure similar to a graph) through a dualization technique. We can show how a common class of tilings can be constructed through this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1987
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90056-4